Non-linear Recovery of Sparse Signal Representations with Applications to Temporal and Spatial Localization

نویسنده

  • Zafer DOǦAN
چکیده

Foundations of signal processing are heavily based on Shannon’s sampling theorem for acquisition, representation and reconstruction. This theorem states that signals should not contain frequency components higher than the Nyquist rate, which is half of the sampling rate. Then, the signal can be perfectly reconstructed from its samples. Increasing evidence shows that the requirements imposed by Shannon’s sampling theorem are too conservative for many naturallyoccurring signals, which can be accurately characterized by sparse representations that require lower sampling rates closer to the signal’s intrinsic information rates. Finite rate of innovation (FRI) is a new theory that allows to extract underlying sparse signal representations while operating at a reduced sampling rate. The goal of this PhD work is to advance reconstruction techniques for sparse signal representations from both theoretical and practical points of view. Specifically, the FRI framework is extended to deal with applications that involve temporal and spatial localization of events, including inverse source problems from radiating fields. The concept of finite rate of innovation (FRI) has been introduced for the sampling and reconstruction of specific classes of continuous-time signals that feature a sparse parametric signal representation such that they have finite degrees of freedom per unit time. Examples of such FRI signals are streams of Diracs, stream of short pulses, piecewise polynomials and piecewise sinusoidal signals. Clearly, these signals are neither bandlimited nor belong to a fixed subspace, and hence the classical sampling theory does not hold. Several new methods in the framework of FRI have shown that it is possible to develop exact sampling and reconstruction schemes to recover the signal innovations. In particular, this is achieved by adequate handling of the signal acquisition, which remains linear, but at the expense of non-linear reconstruction methods. We propose a novel reconstruction method using a model-fitting approach that is based on minimizing the fitting error subject to an underlying annihilation system given by the Prony’s method. First, we showed that this is related to the problem known as structured low-rank matrix approximation as in structured total least squares problem. Then, we proposed to solve our problem under three different constraints using the iterative quadratic maximum likelihood algorithm. Our analysis and simulation results indicate that the proposed algorithms improve the robustness of the results with respect to common FRI reconstruction schemes. We have further developed the model-fitting approach to analyze spontaneous brain activity as measured by functional magnetic resonance imaging (fMRI). For this, we considered the noisy fMRI time course for every voxel as a convolution between an underlying activity inducing signal (i.e., a stream of Diracs) and the hemodynamic response function (HRF). We then validated this method using experimental fMRI data acquired during an event-related study. The results showed for the first time evidence for the practical usage of FRI for fMRI data analysis. We also addressed the problem of retrieving a sparse source distribution from the boundary measurements of a radiating field. First, based on Green’s theorem, we proposed a sensing principle that allows to relate the boundary measurements to the source distribution. We focused on characterizing these sensing functions with particular attention for those that can be derived from holomorphic functions as they allow to control spatial decay of the sensing functions. With this selection, we developed an FRI-inspired non-iterative reconstruction algorithm. Finally,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TDL: Two-dimensional localization for mobile targets using compressive sensing in wireless sensor networks

Many applications in wireless sensor networks (WSNs) ( e.g. , traffic monitoring, environment surveillance and intruder tracking) rely heavily on the availability and accuracy of targets’ locations. Compressive sensing (CS) has been widely applied to localization as it asserts that a small number of samples will suffice for sparse or compressible signal recovery. Despite much progress in CS-bas...

متن کامل

Image Classification via Sparse Representation and Subspace Alignment

Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...

متن کامل

Stochastic Filtering via Reweighted-`1

Many modern signal processing applications can be stated in terms of performing inference on sparse signals that have significant dependencies between those signals. Consider the task of recovering signals xn ∈ R from incomplete and noisy linear measurements yn = Φnxn + n, where Φn ∈ RM×N is the potentially timevarying measurement matrix, n is the measurement noise, and n ∈ K is an index (e.g.,...

متن کامل

Dictionaries for sparse representation and recovery of reflectances

The surface reflectance function of many common materials varies slowly over the visible wavelength range. For this reason, linear models with a small number of bases (5-8) are frequently used for representation and estimation of these functions. In other signal representation and recovery applications, it has been recently demonstrated that dictionary based sparse representations can outperfor...

متن کامل

Greedy Sparse Recovery Algorithm for Target Localization with RF Sensor Networks

In this paper, we propose a greedy sparse recovery algorithm for target localization with RF sensor networks. The target spatial domain is discretized by grid pixels. When the network area consists only of several targets, the target localization is a sparsity-seeking problem such that the Compressed Sensing (CS) framework can be applied. We cast the target localization as a CS problem and solv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015